Optimistic Transactional Boosting Ahmed Hassan Roberto Palmieri Binoy Ravindran

Source URL: www.hyflow.org

• Concurrency control
• Transaction processing
• Data management
• Software transactional memory
• Transactional memory
• Lock
• Optimistic concurrency control
• Non-blocking algorithm
• Data
• Parallel computing
• Isolation
• Concurrent data structure

2011 Paper 5 Question 8 Concurrent and Distributed Systems (a) Consider a queue data structure, with the following interface: interface Queue { void push(Object val);

Source URL: www.cl.cam.ac.uk

Linearizability: A Correctness Condition for Concurrent Objects MAURICE P. HERLIHY and JEANNETTE Carnegie Mellon University M. WING

Source URL: cs.brown.edu

• Data
• Information
• Linearizability
• Monitor
• Sequential consistency
• Concurrent data structure
• Communications protocol
• Consistency model
• Concurrent computing
• Computing
• Concurrency control
• Transaction processing

Deriving Linearizable Fine-Grained Concurrent Objects Martin Vechev Eran Yahav IBM Research

Source URL: www.cs.technion.ac.il

• Concurrency
• Linearizability
• Algorithm
• Tree traversal
• Mutual exclusion
• Non-blocking algorithm
• Concurrent data structure
• Parallel computing
• Priority queue
• Concurrency control
• Computing
• Data management

Experience with Model Checking Linearizability Martin Vechev, Eran Yahav, and Greta Yorsh IBM T.J. Watson Research Center Non-blocking concurrent algorithms offer significant performance advantages, but are very difficul

Source URL: www.cs.technion.ac.il

• Transaction processing
• Memory management
• Linearizability
• Parallel computing
• Concurrent data structure
• Non-blocking algorithm
• Garbage collection
• Algorithm
• Sequential consistency
• Computing
• Concurrent computing
• Concurrency control

Testing Atomicity of Composed Concurrent Operations Ohad Shacham Nathan Bronson Alex Aiken

Source URL: www.cs.technion.ac.il

• Data management
• Data
• Concurrent computing
• Linearizability
• Atomicity
• Lock
• Concurrent data structure
• Parallel computing
• Concurrency
• Concurrency control
• Transaction processing
• Computing

Computer-Assisted Construction of Efficient Concurrent Algorithms Martin Vechev, Eran Yahav, Maged Michael, Hagit Attiya, Greta Yorsh Practical and efficient concurrent systems are notoriously hard to design, implement,

Source URL: www.cs.technion.ac.il

• Concurrency
• Theoretical computer science
• Computer programming
• Algorithm
• Mathematical logic
• Non-blocking algorithm
• Linearizability
• Concurrent data structure
• Actor model
• Computing
• Concurrency control
• Concurrent computing

Applying Dataflow and Transactions to Lee Routing Chris Seaton, Daniel Goodman, Mikel Luj´an, and Ian Watson University of Manchester {seatonc,goodmand,mikel.lujan,watson}@cs.man.ac.uk

Source URL: www.chrisseaton.com

• Concurrent computing
• Computer architecture
• Models of computation
• Parallel computing
• Software transactional memory
• Thread
• Linearizability
• Concurrent data structure
• Lock
• Computing
• Concurrency control
• Transaction processing

Finding and Reproducing Heisenbugs in Concurrent Programs Madanlal Musuvathi Microsoft Research Shaz Qadeer Microsoft Research

Source URL: research.microsoft.com

• Concurrency control
• Threads
• Scheduling
• Critical section
• Lock
• Concurrent data structure
• Multithreading
• Monitor
• Kernel
• Computing
• Computer programming
• Concurrent computing

NDSeq: Runtime Checking for Nondeterministic Sequential Specifications of Parallel Correctness Jacob Burnim Tayfun Elmas

Source URL: www.eecs.berkeley.edu

• Data
• Concurrency control
• Concurrent computing
• Databases
• Serializability
• Parallel computing
• Actor model
• Concurrent data structure
• Thread
• Computing
• Transaction processing
• Data management